package leetcode;
//反转一个单链表。
//
// 示例:
//
// 输入: 1->2->3->4->5->NULL
//输出: 5->4->3->2->1->NULL
//
// 进阶:
//你可以迭代或递归地反转链表。你能否用两种方法解决这道题？
// Related Topics 链表


//leetcode submit region begin(Prohibit modification and deletion)

//  Definition for singly-linked list.
class ListNode {
      int val;
      ListNode next;
      ListNode(int x) { val = x; }
  }

/**
 * @Author: dch
 * @Date: 2020/5/28 21:15
 * @Description:
 */
public class ListNodeReverse {
    class Solution {
        public ListNode reverseList(ListNode head) {
            ListNode pre=null;
            ListNode curr=head;
            ListNode temp=null;
            while(curr!=null){
                temp=curr.next;
                curr.next=pre;
                pre = curr;
                curr = temp;
            }
            return pre;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)
}


